New Optimal Binary Sequences with Period $4p$ via Interleaving Ding-Helleseth-Lam Sequences
نویسندگان
چکیده
Binary sequences with optimal autocorrelation play important roles in radar, communication, and cryptography. Finding new binary sequences with optimal autocorrelation has been an interesting research topic in sequence design. Ding-Helleseth-Lam sequences are such a class of binary sequences of period p, where p is an odd prime with p ≡ 1(mod 4). The objective of this letter is to present a construction of binary sequences of period 4p via interleaving four suitable Ding-Helleseth-Lam sequences. This construction generates new binary sequences with optimal autocorrelation which can not be produced by earlier ones.
منابع مشابه
The Linear Complexity of a Class of Binary Sequences With Optimal Autocorrelation
Binary sequences with optimal autocorrelation and large linear complexity have important applications in cryptography and communications. Very recently, a class of binary sequences of period 4p with optimal autocorrelation was proposed by interleaving four suitable Ding-Helleseth-Lam sequences (Des. Codes Cryptogr., DOI 10.1007/s10623-017-0398-5), where p is an odd prime with p ≡ 1( mod 4). The...
متن کاملNew families of binary sequences with optimal three-level autocorrelation
In this correspondence we give several new families of binary sequences of period with optimal three-level autocorrelation, where 2(mod 4). These sequences are either balanced or almost balanced. Our construction is based on cyclotomy.
متن کاملAbout the Linear Complexity of Ding-Hellesth Generalized Cyclotomic Binary Sequences of Any Period
We defined sufficient conditions for designing Ding-Helleseth sequences with arbitrary period and high linear complexity for generalized cyclotomies. Also we discuss the method of computing the linear complexity of Ding-Helleseth sequences in the general case.
متن کاملSeveral classes of binary sequences with three-level autocorrelation
In this correspondence we describe several classes of binary sequences with three-level autocorrelation. Those classes of binary sequences are based on cyclic almost difference sets. Some classes of binary sequences have optimum autocorrelation.
متن کاملOn a Class of Almost Difference Sets Constructed by Using the Ding-Helleseth-Martinsens Constructions
Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost difference set as their characteristic sets. How to construct new families of almost difference set is an important research topic in such fields as communicatio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1705.09623 شماره
صفحات -
تاریخ انتشار 2017